Computability and Recursion
نویسندگان
چکیده
منابع مشابه
Computability and recursion
We consider the informal concept of “computability” or “effective calculability” and twoof the formalisms commonly used to define it, “(Turing) computability” and“(general) recursiveness”. We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecia...
متن کاملSequential Computability of a Function: Diagonal Space and Limiting Recursion
We consider the real sequences in I = [0, 1) and real functions on I . A computability notion with respect to the uniformity {Un}, where Un(x) = [ k 2n , k+1 2n ) if x ∈ [ k 2n , k+1 2n ), will be called Dcomputability. An R-computable sequence from I will be shown to be approximated by a recursive sequence of rational numbers with a limiting recursive modulus of convergence with respect to {Un...
متن کاملSequential Computability of a Function. Effective Fine Space and Limiting Recursion
We consider real sequences in I = [0, 1) and real functions on I . It is first shown that, as for real sequences from I , R-computability (computability with respect to the Euclidean topology) implies “weak Fine-computability.” Using this result, we show that “Fine-sequential computability” and “L∗-sequential computability” are equivalent for effectively locally Fine-continuous functions as wel...
متن کاملSequential computability of a function - diagonal space and limiting recursion - Yoshiki Tsujii
We consider the real sequences in I = [0, 1) and real functions on I. A computability notion with respect to the uniformity {Un}, where Un(x) = [ k 2n , k+1 2n ) if x ∈ [ k 2n , k+1 2n ), will be called D-computability. An R-computable sequence from I will be shown to be approximated by a recursive sequence of rational numbers with a limiting recursive modulus of convergence with respect to {Un...
متن کاملective uniformity versus limiting recursion in sequential computability of a function
The major objective of this article is a re nement of treatments of the mutual relationship between two notions of sequential computability of a function which is possibly Euclidean discontinuous one using limiting recursion and one using e ective uniformity We also speculate on these methods from a mathematician s viewpoint
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Symbolic Logic
سال: 1996
ISSN: 1079-8986,1943-5894
DOI: 10.2307/420992